Explicit Mathematics with Positive Stratified Comprehension, Join and Uniform Monotone Inductive Definitions

نویسنده

  • Samuel Bucheli
چکیده

Der Wirklichkeit ist mit Logik nur zum Teil beizukommen.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Proof-Theoretic Strength of Monotone Induction in Explicit Mathematics

We characterize the proof-theoretic strength of systems of explicit mathematics with a general principle (MID) asserting the existence of least fixed points for monotone inductive definitions, in terms of certain systems of analysis and set theory. In the case of analysis, these are systems which contain the Σ2-axiom of choice and Π 1 2-comprehension for formulas without set parameters. In the ...

متن کامل

Inductive Situation Calculus

Temporal reasoning has always been a major test case for knowledge representation formalisms. In this paper, we develop an inductive variant of the situation calculus in ID-logic, classical logic extended with Inductive Definitions. This logic has been proposed recently and is an extension of classical logic. It allows for a uniform representation of various forms of definitions, including mono...

متن کامل

Monotone Inductive Definitions in Explicit Mathematics

The context for this paper is Feferman's theory of explicit mathematics, T 0. We address a problem that was posed in F 82]. Let MID be the principle stating that any monotone operation on classiications has a least xed point. The main objective of this paper is to show that T 0 + MID, when based on classical logic, also proves the existence of non-monotone inductive deenitions that arise from a...

متن کامل

A Logical Study of Some Common Principles of Inductive Definition and its Implications for Knowledge Representation

The definition is a common form of human expert knowledge, a building block of formal science and mathematics, a foundation for database theory and is supported in various forms in many knowledge representation and formal specification languages and systems. This paper is a formal study of some of the most common forms of inductive definitions found in scientific text: monotone inductive defini...

متن کامل

A Deductive System for FO(ID) Based on Least Fixpoint Logic

The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to extend Gentzen’s sequent calculus to obtain a deductive inference method for FO(ID). The main difficulty in building such a proof system is the representation and inference of unfounded sets. It turns out that we can represent unfounde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008